Accelerated Ants Routing in Dynamic Networks

نویسندگان

  • Hiroshi Matsuo
  • Kouichi Mori
چکیده

Efficiently routing in a dynamic network is a important problem in ad hoc network according to development of personal data assistant (PDA) and wireless network equipment. However conventional routing algorithm is difficult to apply to dynamic topology network. Q-Routing, DRQ-Routing and Ants-Routing which are based on reinforcement learning technique are proposed. But convergence speed and routing result are still unsatisfied. In this paper, accelerated AntsRouting which increase convergence speed and obtain good routing path is discussed. Experiment on dynamic network showed that accelerated Ants-Routing learns the optimum routing in terms of convergence speed and average packet latency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

Swarm Intelligence for Routing in Ad Hoc Wireless Networks

Ad hoc networks consist of autonomous self-organized nodes. Nodes use a wireless medium for communication, thus two nodes can communicate directly if and only if they are within each other’s transmission radius. Examples are sensor networks (attached to a monitoring station), rooftop networks (for wireless Internet access), and conference and rescue scenarios for ad hoc networks, possibly mobil...

متن کامل

Spectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants

The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...

متن کامل

Hierarchical routing in traffic networks

In this paper the design of a dynamic Routing system, called Hierarchical routing system, has been developed. It splits traffic networks into several smaller and less complex networks by introducing a hierarchy. The Hierarchical routing system therefore consists of several distributed Routing systems where each of it is responsible for one network of the hierarchical network. The route optimiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001